cient parallel algorithm for list Viterbi decoding

نویسنده

  • Antonio M. Peinado
چکیده

There is nowadays an increasing interest in list Viterbi decoding, especially for transmission of audio and video over wireless channels. List Viterbi decoding outperforms conventional Viterbi decoding at the expense of an increase in complexity. In this paper, we propose an e cient parallel list Viterbi algorithm with lower computational complexity and memory requirements. ? 2002 Elsevier Science B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

utput Decoding Algorithms for Continuous Decoding of Parallel Concatenated Convolutional Codes

I n this paper we propose new decoding algorithms to be embedded in the iterative decoding strategy of parallel concatenated convolutional codes. They are derived f rom the optimum maximum-a-posteriori algorithm and permit a continuous decoding of the coded sequence without requiring trellis termination of the constituent codes. Two basic versions of the continuous algorithm and their suboptimu...

متن کامل

On Optimal Erasure and List Decoding Schemes of Convolutional Codes

A modified Viterbi algorithm with erasures and list-decoding is introduced. This algorithm is shown to yield the optimal decoding rule of Forney with erasures and variable list-size. For the case of decoding with erasures, the optimal algorithm is compared to the simple algorithm of Yamamoto and Itoh. The comparison shows a remarkable similarity in simulated performance, but with a considerably...

متن کامل

On Ef cient Viterbi Decoding for Hidden semi-Markov Models

We present algorithms for improved Viterbi decoding for the case of hidden semi-Markov models. By carefully constructing directed acyclic graphs, we pose the decoding problem as that of finding the longest path between specific pairs of nodes. We consider fully connected models as well as restrictive topologies and state duration conditions, and show that performance improves by a significant f...

متن کامل

Parallel Viterbi decoding methods for uncontrollable and controllable sources

AbsrructThe fastest conventional Viterhi decoding method processes all states in parallel, but still decodes code symbols sequentially. In order to decode faster than this rate, parallel methods must be developed to break the processing into independent state-parallel decoding tasks. This paper discusses parallel Viterbi decoding for two different cases: uncontrollable sources and controllable ...

متن کامل

A Study of Viterbi Decoder Algorithm for Wireless LANs

Viterbi Decoders are commonly used to decode convolutional codes in communications systems. This Viterbi Decoder is a fully parallel implementation which gives fast data throughput. The decoder is targeted for WiMAX and Wireless LAN applications. Input symbol metric pairs are decoded into output data bits by the maximum likelihood Viterbi processor core. Decoder supports both hard and soft inpu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002